منابع مشابه
Numerical Simulation of Non-Gaussian Random Fields
The non-Gaussian random fields are used to modelling some dynamic loads generated by wind turbulence, ocean waves, earthquake ground motion etc. These fields also represent the uncertain properties of different materials (reinforced concrete, composite, soils etc.). This paper presents some methods and the corresponding algorithms to the numerical simulation of stationary non-Gaussian random fi...
متن کاملFast generation of isotropic Gaussian random fields on the sphere
The efficient simulation of isotropic Gaussian random fields on the unit sphere is a task encountered frequently in numerical applications. A fast algorithm based on Markov properties and Fast Fourier Transforms in 1d is presented that generates samples on an n×n grid in O(n logn). Furthermore, an efficient method to set up the necessary conditional covariance matrices is derived and simulation...
متن کاملSimulation of Sample Paths of Non Gaussian Stationary Random Fields
Mathematical justifications are given for a simulation technique of multivariate nonGaussian random processes and fields based on Rosenblatt’s transformation of Gaussian processes. Different types of convergences are given for the approaching sequence. Moreover an original numerical method is proposed in order to solve the functional equation yielding the underlying Gaussian process autocorrela...
متن کاملIsotropic Gaussian Random Fields on the Sphere: Regularity, Fast Simulation and Stochastic Partial Differential Equations
Isotropic Gaussian random fields on the sphere are characterized by Karhunen–Loève expansions with respect to the spherical harmonic functions and the angular power spectrum. The smoothness of the covariance is connected to the decay of the angular power spectrum and the relation to sample Hölder continuity and sample differentiability of the random fields is discussed. Rates of convergence of ...
متن کاملA Fast and Exact Simulation Algorithm for General Gaussian Markov Random Fields
This paper presents a fast and exact simulation algorithm for a general Gaussian Markov Random Field (GMRF) defined on a lattice, . For a neighborhood, the algorithm has initializationcost of flops and exact samples are then available using flops. Conditioned samples on general constraints costs only extra flops. The algorithm is easy to generalize to non-rectangular lattices, compute the log-l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monte Carlo Methods and Applications
سال: 2011
ISSN: 0929-9629,1569-3961
DOI: 10.1515/mcma.2011.009